Location:
Search - b tree
Search list
Description: 课程设计：
1.求出在一个n×n的棋盘上，放置n个不能互相捕捉的国际象棋“皇后”的所有布局。
2.设计一个利用哈夫曼算法的编码和译码系统，重复地显示并处理以下项目，直到选择退出为止。
【基本要求】
1) 将权值数据存放在数据文件(文件名为data.txt，位于执行程序的当前目录中)
2) 分别采用动态和静态存储结构
3) 初始化：键盘输入字符集大小n、n个字符和n个权值，建立哈夫曼树；
4) 编码：利用建好的哈夫曼树生成哈夫曼编码；
5) 输出编码；
6) 设字符集及频度如下表：
字符 空格 A B C D E F G H I J K L M
频度 186 64 13 22 32 103 21 15 47 57 1 5 32 20
字符 N O P Q R S T U V W X Y Z
频度 57 63 15 1 48 51 80 23 8 18 1 16 1
-Curriculum design:
1. Obtained in an n × n chessboard, the place to catch each other should not n个chess "Queen" of all the layout.
2. The design of a use of Huffman coding and decoding algorithms systems, and deal with duplicate to show the following items until the exit date selection.
The basic requirements 【】
1) will be the right value data stored in data files (file named data.txt, located in the implementation of procedures in the current directory)
2), respectively, dynamic and static storage structure
3) Initialization: keyboard input character set size of n, n and n characters of the right value, set up Huffman tree
4) Coding: Using the built Huffman tree generated Huffman coding
5) output coding
6) The character set and the frequency of the following table:
Space characters A B C D E F G H I J K L M
Frequency of 186 64 13 22 32 103 21 15 47 57 1 5 32 20
Character N O P Q R S T U V W X Y Z
Frequency 57 63 15 1 48 51 80 23 8 18 1 16 1
Platform: |
Size: 550912 |
Author: 赵刚 |
Hits:
Description: Simple Browse是一款简洁易用，源码公开的图片浏览器。它短小精悍，浏览快速，生成的缩图精美漂亮，能浏览常见的多种图像格式。
它是仿照ACDSee而做的，样子和使用方法都挺象。但是有一点不同：在ACDSee里，浏览到缩图后，想看大图，要用View命令切换到另一个界面，有时候，这种做法不够方便；而Simple Browse的做法是，目录树、缩图文件列表和大图观看窗口，全放在一个界面中，省去切换的麻烦。
使用
Simple Browse的使用方法和ACDSee很象，不同之处在于把大图观看窗口放在界面的中央，观看大图时比ACDSee更方便。它实现的是一些最基本最常用的功能，包括：
（1） 浏览缩图，观看大图。
（2） 改变缩图的大小。
（3） 可将缩图保存在文件中，下次浏览时会快很多。
（4） 观看大图时，改变大图的缩放比例，改变窗口背景色。
（5） 浏览大图时，有方便的前进、后腿按钮。-Simple Browse is a simple to use, open-source browser picture. It dapper, quick browser, the thumbnail generation of exquisite beautiful, able to browse a variety of common image format.
It is modeled after ACDSee and do like and use, as could hang. However, there is one difference: in ACDSee, the visit to the thumbnail, the want to see large map, using View command to switch to another interface, and sometimes not enough to facilitate this practice Simple Browse and practice, the directory tree, reduce plans to enlarge the list of files and watch the window, all in one interface, eliminating the trouble of switching.
Use
Simple Browse and use much like ACDSee, the only difference is the window to watch on the big map of the central interface to see the larger more convenient than ACDSee. It is some of the most fundamental achievement of the most commonly used features, including:
(1) View thumbnail to see the larger image.
(2) to change the thumbnail size.
(3) can b
Platform: |
Size: 534528 |
Author: xjc |
Hits:
Description: 基于STM32微处理器的SD卡（TF卡）文件系统读写.
103ZC,ZD等有SDIO，检查中。-This is a simple demonstration, based on STM32 and working with ST Evaluation board MB525 revA (old board), using the Embeddeded Library File System “EFSL” with an "SD" memory card in
order to explore the contents of this SD card and show, on the LCD color, the Tree of directories/files within the SD card and read files contents.
PS: in last boards ( rev B) you should modify the joystick driver to get it working fine.
Platform: |
Size: 163840 |
Author: Highend |
Hits:
Description: 这是一个验证数据结构的二叉树的公式的一个程序，具体的输入格式为：输入实例:-+a##*b##-c##d##/e##f-This is a binary tree data structure to verify the formula for a procedure, the specific input format is: input examples :-+a##*b##-c##d##/e##f##
Platform: |
Size: 7168 |
Author: 李文 |
Hits:
Description: 实现二叉树b的各种运算：
1. 输出二叉树；
2. 输出 H 结点的左·右孩子结点值；
3. 输出二叉树b的深度；
4. 输出二叉树b的宽度；
5. 输出二叉树b的结点个数；
6. 输出二叉树b的叶子结点个数。-Binary Tree b to achieve a variety of computing: 1. Output tree 2. Output the children of node H child nodes around node value 3. Output binary tree of depth b 4. Output tree width b 5. output node of binary tree the number of b 6. output binary tree node b the number of leaves.
Platform: |
Size: 2048 |
Author: fishle |
Hits:
Description: 电路与系统中电路的矩阵描述以及关联矩阵，Q矩阵以及B矩阵和树。-Circuits and Systems in the circuit description as well as the incidence matrix matrix, Q matrix and B matrix and the tree.
Platform: |
Size: 124928 |
Author: Henry |
Hits:
Description: 克鲁斯卡尔算法思想.cpp
int seekedge(EDGE * (&a), int n)
void bubble(EDGE * (&a), int size)
void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边
void storepicture(EDGE * (&a), int n, VERTEX *b, int m) -Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m)
Platform: |
Size: 24576 |
Author: 李虚东 |
Hits:
Description: 双树复数小波变换的Matlab程序的B部分，全部解压到同一个文件夹下后可直接调用函数-Dual-Tree Complex Wavelet Transform Matlab for the B part of the procedure, all extract to the same folder can be a direct call function
Platform: |
Size: 41984 |
Author: suxiaoyuan |
Hits:
Description: uart16550 is a 16550 compatible (mostly) UART core.
The bus interface is WISHBONE SoC bus Rev. B.
Features all the standard options of the 16550 UART:
FIFO based operation, interrupt requests and other.
The datasheet can be downloaded from the CVS tree along with the source code. -uart16550 is a 16550 compatible (mostly) UART core.
The bus interface is WISHBONE SoC bus Rev. B.
Features all the standard options of the 16550 UART:
FIFO based operation, interrupt requests and other.
The datasheet can be downloaded from the CVS tree along with the source code.
Platform: |
Size: 1760256 |
Author: CloudZhang |
Hits:
Description: 二叉树的基本算法。（1） 输出二叉树B；
（2） 输出二叉树B的深度；
（3） 输出H结点的左、右孩子结点值；
（4） 输出二叉树B的宽度；
（5） 输出二叉树B的结点个数；
输出二叉树B的叶子结点个数
-The basic algorithm for binary tree。(1) output binary tree B
(2) The output of a binary tree B of depth
(3) The output of H nodes left and right child node value
(4) outputs a binary tree B, width
(5) output node B, the number of binary trees
Output binary tree B, the number of leaf nodes
Platform: |
Size: 1024 |
Author: xjj |
Hits:
Description: (一) 编写一个程序LAGO7-1.CPP，实现二叉树的各种运算，并在此基础上设计一个主程序完成如下功能。
（1） 输出二叉树B；
（2） 输出二叉树B的深度；
（3） 输出H结点的左、右孩子结点值；
（4） 输出二叉树B的宽度；
（5） 输出二叉树B的结点个数；
输出二叉树B的叶子结点个数
-(A) to prepare a program LAGO7-1.CPP, to achieve a variety of binary operations, and on this basis, design a main program performs the following functions.
(1) output binary tree B
(2) The output of a binary tree B of depth
(3) The output of H nodes left and right child node value
(4) outputs a binary tree B, width
(5) output node B, the number of binary trees
(6) outputs a binary tree B, the number of leaf nodes
Platform: |
Size: 2048 |
Author: xjj |
Hits:
Description: AVL tree . AVL tree is a n algrothim that can be used to study the b tech subject AAD.
Platform: |
Size: 2048 |
Author: subash |
Hits:
Description: 附有实验报告。。1、查找的基本概念和查找的几种方法以及求查找的平均查找长度。
2、静态查找表（基于线性表的查找法）。顺序查找、二分查找和分块查找。
3、动态查找表（基于树的查找法）。二叉排序树、二叉平衡树、 B_ 树和B+ 树。
-1, find the basic concepts and find several methods, as well as seeking to find the average search length. 2, static lookup table (based on a linear table lookup method). Sequential search, binary search and sub-block search. 3, dynamic look-up table (based on tree search method). Binary sort tree, balanced binary tree, B_ tree and B+ trees.
Platform: |
Size: 249856 |
Author: jingjing |
Hits:
Description: 用C语言实现B树的相关运算
实现B树的相关运算-B with the C language implementation of the relevant tree operation
Tree-related operations to achieve B
Platform: |
Size: 3072 |
Author: 清风 |
Hits:
Description: 项目名：北大青鸟S2项目BBS（JSP论坛）
开发环境：SQL2005 + myEclipse6.5
功能说明：
1、注册用户可以发、改、删（管理员）帖子。
2、论坛后台管理 a：版块管理 b：用户管理（未实现）。
亮点技术：
1、树形打印所有版块。
实现思路：
使用递归调用。
2、分页显示。
实现思路：
先获得所有记录保存到泛型，然后再通过for语句的下标访问。
Author：青鸟学子
QQ：64578820
Msn：foart@hotmail.com
-Project Name: Beida Jade Bird S2 Project BBS (JSP forum) Development Environment: SQL2005+ myEclipse6.5 Function Description: 1, registered users can send, change, delete (administrator) posts. 2, the forum admin a: Forum Management b: user management (not achieved). Highlights Technology: 1, tree print all Forum. Implementation ideas: the use of recursive calls. 2, paging display. Implementation ideas: first, to obtain all the records saved to the generic, and then through the for statement subscript access. Author: Bluebird students QQ: 64578820 Msn: foart@hotmail.com
Platform: |
Size: 15876096 |
Author: 刘宇 |
Hits:
Description: 各种数据结构的实现 包括顺序表、单链表、双向链表、循环链表、顺序栈、链式栈、顺序队列、链式队列、优先级队列、串、二叉树、线索二叉树、哈夫曼树、B+树、图的c++实现-Implementation of the various data structures, including order forms, a single linked list, doubly linked lists, circular list, the order of the stack, the stack chain, the order queue, chain queues, priority queues, strings, binary trees, threaded binary tree, Hough Man tree, B+ trees, graphs c++ Implementation
Platform: |
Size: 68608 |
Author: ninja |
Hits:
Description: 一个表达式和一棵二叉树之间，存在着自然的对应关系。写一个程序，实现基于二叉树表示的算术表达式Expression的操作。
【基本要求】
【一】【必做部分】
假设算术表达式Expression内可以含有变量（a-z）,常量（0-9）和二元运算符（+，-，*，/，^（乘幂））。实现以下操作：
（1）ReadExpr(E)――以字符序列的形式输入语法正确的前缀表达式并构造表达式E。
（2）WriteExpr(E)――用带括号的中缀表达式输出表达式E。
（3）Assign(V，c)――实现对变量V的赋值（V=c），变量的初值为0。
（4）Value(E)――对算术表达式E求值。
（5）CompoundExpr(p,E1,E2)――构造一个新的复合表达式（E1）p（E2）。
【二】【选做部分】
（1）以表达式的原书写形式输入，支持大于0的正整数常量；
（2）增加常数合并操作MergeConst(E)——合并表达式E中所有常数运算。例如，对表达式E=(2+3-a)*(b+3*4)进行合并常数的操作后，求得E=(5-a)*(b+12)
【测试数据】
1) 分别输入0；a -91 +a*bc +*5x2*8x +++*3^*2^x2x6并输出。
2) 每当输入一个表达式后，对其中的变量赋值，然后对表达式求值。
3) 还有很多测试的数据，详细请见附上的文件Test.txt。
-Between an expression and a binary tree, there is a natural correspondence. Write a program to realize the arithmetic expression based on Binary Tree for Expression of the operation.
Basic requirements of】 【
【1】 【will do some】
Suppose an arithmetic expression can contain variables in Expression (az), constant (0-9) and the binary operator (+,-,*,/,^( power)). To achieve the following:
(1) ReadExpr (E)- in the form of a sequence of characters enter the correct prefix expression syntax and constructs the expression E.
(2) WriteExpr (E)- with the infix expression with parentheses output expression E.
(3) Assign (V, c)- to achieve the assignment of the variable V (V = c), the variable s initial value is 0.
(4) Value (E)- E evaluation of arithmetic expressions.
(5) CompoundExpr (p, E1, E2)- construct a new complex expression (E1) p (E2).
【2】 【choose to do some】
(1) the original written form of expression input, support for constant positive integer greater than 0
(2)
Platform: |
Size: 250880 |
Author: snake |
Hits:
Description: 关于数据结构中B树的常见问题及回答，归纳的比较全面，适合与相关专业的学生，特别是考生-B on the tree data structure and to answer frequently asked questions, summed up a more comprehensive, suitable and relevant professional students, especially candidates
Platform: |
Size: 70656 |
Author: asa |
Hits:
Description: Implementation of Leftist tree and B heap, also has random run to test performance
Platform: |
Size: 13312 |
Author: liuyazhen |
Hits:
Description: 二)二叉排序树的一些基本操作
(1)利用二叉链表的存储形式，从键盘输入建立一棵二叉排序树；
(2)对（1）中建立的二叉排序树进行中序遍历并打印；
(3)编写算法，判断一棵二叉树是否为二叉排序树。
(4)在（1）建立的二叉排序树中，查找一个树中不存在的关键字后并插入，之后打印该树；
-B) binary tree of some sort of basic operations (1) the use of binary list of the storage form of input from the keyboard to establish a binary sort tree (2) (1) create a binary tree in order traversal and print (3) the preparation method, a binary tree to determine whether the binary sort tree. (4) (1) to establish the binary sort tree, find a tree that does not exist and insert the keyword, and then print the tree
Platform: |
Size: 1024 |
Author: 王玉珏 |
Hits: